Block and Seed Bicgstab Algorithms for Nonsymmetric Multiple Linear Systems
نویسندگان
چکیده
In this paper we give a block version of the BiCGSTAB algorithm for solving multiple linear systems using some algebraic orthogonalities. These orthogonalities allow us to deene a new procedure called PNB : Partial Near Breakdown procedure in order to stabilize the convergence of the block BiCGSTAB algorithm. We also introduce a seed version of the (block) BiCGSTAB algorithm. Finally, some numerical examples will be reported to illustrate the eeectiveness of the proposed methods.
منابع مشابه
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملExtending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
The technique that was used to build the eigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is capable of computing a few smallest magnitude eigenvalues and their corresponding left and right eigenvectors of a nonsymmetric matrix using only a small window...
متن کاملBlock Bidiagonalization Methods for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
Many applications require the solution of large nonsymmetric linear systems with multiple right-hand sides. Instead of applying an iterative method to each of these systems individually, it is often more eecient to use a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose block versions of Galerkin/minimal residual pair of bidiagonal...
متن کاملML(k)BiCGSTAB: A BiCGSTAB Variant Based on Multiple Lanczos Starting Vectors
We present a variant of the popular BiCGSTAB method for solving nonsymmetric linear systems. The method, which we denote by ML(k)BiCGSTAB, is derived from a variant of the BiCG method based on a Lanczos process using multiple (k > 1) starting left Lanczos vectors. Compared with the original BiCGSTAB method, our new method produces a residual polynomial which is of lower degree after the same nu...
متن کاملThe block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
In this paper, we present the block least squares method for solving nonsymmetric linear systems with multiple righthand sides. This method is based on the block bidiagonalization. We first derive two algorithms by using two different convergence criteria. The first one is based on independently minimizing the 2-norm of each column of the residual matrix and the second approach is based on mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000